Fault Tolerant Leader Election in Distributed Systems
نویسنده
چکیده
There are many distributed systems which use a leader in their logic. When such systems need to be fault tolerant and the current leader suffers a technical problem, it is necesary to apply a special algorithm in order to choose a new leader. In this paper I present a new fault tolerant algorithm which elects a new leader based on a random roulette wheel selection.
منابع مشابه
Designing and Evaluating Fault-tolerant Leader Election Algorithms
Fault-tolerant leader election is a basic building block for dependable distributed computing, since it allows coordinating decisions among replicas such that they remain consistent. Indeed, several fault-tolerant agreement protocols rely on an eventual leader election service. This problem has been initially studied in crash-prone systems, and more recently in other failure scenarios, e.g., cr...
متن کاملA Leader Election Protocol for Fault Recovery in Asynchronous Fully-Connected Networks
We introduce a new algorithm for consistent failure detection in asynchronous systems. Informally, consistent failure detection requires processes in a distributed system to distinguish between two diierent populations: a fault free population and a faulty one. The major contribution of this paper is in combining ideas from group membership and leader election, in order to have an election prot...
متن کاملAlgebraic Speciication of Dynamic Leader Election Protocols in Broadcast Networks
The problem of leader election in distributed systems is considered. Components communicate by means of buuered broadcasting as opposed to usual point-to-point communication. In this paper three leader election protocols of increasing maturity are speciied. We start with a simple leader election protocol, where an initial leader is present. In the second protocol this assumption is dropped. Eve...
متن کاملVerification of Distributed Erlang Programs using Testing, Model Checking and Theorem Proving
Software infiltrates every aspect of modern society. Production, transportation, entertainment, and almost every other sphere that influences modern living are either directly or indirectly dependent on software systems. Software systems provide such a degree of flexibility that their role as a driving force for new and better products is indisputable. The downside is that software systems are ...
متن کاملEnhanced Bully Algorithm for Leader Node Election in Synchronous Distributed Systems
In distributed computing systems, if an elected leader node fails, the other nodes of the system need to elect another leader. The bully algorithm is a classical approach for electing a leader in a synchronous distributed computing system. This paper presents an enhancement of the bully algorithm, requiring less time complexity and minimum message passing. This significant gain has been achieve...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1703.02247 شماره
صفحات -
تاریخ انتشار 2017